NJIT HONOR CODE

All Students should be aware that the Department of Mathematical Sciences takes the NJIT Honor code very seriously and enforces it strictly.  This means there must not be any forms of plagiarism, i.e., copying of homework, class projects, or lab assignments, or any form of cheating in quizzes and exams.  Under the Honor Code, students are obligated to report any such activities to the Instructor.
 

Mathematics 426-102:
Advanced Discrete Mathematics

Spring 2004

 

M, R:  TIER 108, 1:00 PM – 2:25 PM

 

v     Instructor:  Prof. Kappraff

v     Office:  208 A

v     Phone:  973-596-3490

v     Email:  kappraff@adm.njit.edu

v     Office Hours:    TBA

 

 

Textbook:     Discrete Mathematics and its Applications – Rosen

            Applications of Discrete Mathematics – Michaels and Rosen

            Additional Notes

 

 

Course Policies:

Attendance is essential for this course.  You must e-mail me if you cannot attend a class.  Only two unexcused absences will be permitted.   Please make every effort to arrive at class no later than 10 minutes after the beginning of the period.

 

Grading Policy:  The grade will be based on a midterm exam and a final.  In addition students will be asked to create a computer program to implement some aspect of the course.  Additional graded assignments will be given over the duration of the course.

 

Course Outline and Topics:

 

 

Week

Topic

Sections

1

Graphs and Maps, Introduction to the Laws of form

7.1-7.8, Notes

2

Euler and Hamilton paths, Djiksta’s Algorithm Chinese Postman Problem

7.5, 7.6, Ch. 20, Notes

3

Trees – Introduction to trees, spanning trees, minimal spanning trees, Huffman trees Kruskal’s algorithm.

8.1, 8.2, 8.5, 8.6

4

Tree traversal, tree sorting

8.3, 8.4

5

Network flows

Ch. 23, Notes

6

Stirling numbers

Ch. 6, Notes

7

Catalan numbers

Ch. 7, Notes

8

Burnside-Polya Counting Methods

Ch. 12, Notes

9

Languages and grammars, finite state machines

10.1, 10.2

Midterm Exam

10

Finite state machines

10.3

11

Language recognition, Kleene’s theorem, Turing machines

10.4, 10.5

12

Kehonen maps

Notes

13

Petrie Nets

Ch. 24

14

Primitive Shift Registers

Notes

Final Exam

 

 

 

Class Policies:

Attendance and Participation:  Students must attend all classes. Absences from class will inhibit your ability to fully participate in class discussions and problem solving sessions and, therefore, affect your grade. Tardiness to class is very disruptive to the instructor and students and will not be tolerated.

Makeup Exam Policy: There will be no makeup exams, except in rare situations where the student has a legitimate reason for missing an exam, including illness, death in the family, accident, requirement to appear in court, etc. The student must notify the Math office and the Instructor that he/she will miss an exam. In all cases, the student must present proof for missing the exam, e.g., a doctor's note, police report, court notice, etc., clearly stating the date AND times.

Cellular Phones:  All cellular phones and beepers must be switched off during all class times.

 

 

Last revised: 01/08/04